Search results for "Computer Science::Cryptography and Security"
showing 10 items of 36 documents
Stealthy Attacks in Cloud-Connected Linear Impulsive Systems
2018
This paper studies a security problem for a class cloud-connected multi-agent systems, where autonomous agents coordinate via a combination of short-range ad-hoc commu- nication links and long-range cloud services. We consider a simplified model for the dynamics of a cloud-connected multi- agent system and attacks, where the states evolve according to linear time-invariant impulsive dynamics, and attacks are modeled as exogenous inputs designed by an omniscent attacker that alters the continuous and impulsive updates. We propose a definition of attack detectability, characterize the existence of stealthy attacks as a function of the system parameters and attack properties, and design a fami…
"Table 28" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 1…
2019
Resolution and average of reconstructed ToF mass for a given simulated mass for ID+calo candidates.
"Table 28" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 1…
2019
Resolution and average of reconstructed ToF mass for a given simulated mass for ID+calo candidates.
Optical-data storage-readout technique based on fractal encrypting masks
2009
We propose the use of fractal structured diffractive masks as keys in secure storage-readout systems. A joint transform correlator based on a photorefractive crystal in the Fourier domain is implemented to perform encryption and decryption. We discuss the advantages of encrypting information using this kind of deterministic keys in comparison to conventional random phase masks. Preliminary experimental results are presented to demonstrate the effectiveness of the proposed system.
Optical security and encryption with totally incoherent light
2001
We present a method for securing and encrypting information optically by use of totally incoherent illumination. Encryption is performed with a multichannel optical processor working under natural (both temporal and spatially incoherent) light. In this way, the information that is to be secured can be codified by use of color signals and self-luminous displays. The encryption key is a phase-only mask, providing high security from counterfeiting. Output encrypted information is recorded as an intensity image that can be easily stored and transmitted optically or electrically. Decryption or authentication can also be performed optically or digitally. Experimental results are presented.
Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/926170 A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the sing…
POLYNOMIAL GROWTH OF THE*-CODIMENSIONS AND YOUNG DIAGRAMS
2001
Let A be an algebra with involution * over a field F of characteristic zero and Id(A, *) the ideal of the free algebra with involution of *-identities of A. By means of the representation theory of the hyperoctahedral group Z 2wrS n we give a characterization of Id(A, *) in case the sequence of its *-codimensions is polynomially bounded. We also exhibit an algebra G 2 with the following distinguished property: the sequence of *-codimensions of Id(G 2, *) is not polynomially bounded but the *-codimensions of any T-ideal U properly containing Id(G 2, *) are polynomially bounded.
New key based on tilted lenses for optical encryption
2016
A novel concept based on tilted spherical lenses for optical encryption using Lohmann’s type I systems is presented. The tilt angle of the spherical lenses is used as an encrypted key and the decryption performance is studied both qualitatively (visual image degradation) and quantitatively (mean squared error analysis) by numerical simulations. The paper presents a general mathematical framework in virtue of the dioptric power matrix formalism and oblique central refraction used in the optometry field. Computer simulations show that image information cannot be retrieved after a few degrees of tilt on both spherical lenses in the encryption system. In addition, a preliminary experiment is pr…
"Table 1" of "Lowest Q**2 measurement of the gamma* p --> delta reaction: Probing the pionic contribution."
2006
Measured value of SIG(C=T) + EPS*SIG(C=L) as a function of the pion angle relative to the virtual photon direction.
"Table 2" of "Measurement of inclusive K*(892)0, Phi(1020) and K*2(1430)0 production in hadronic Z decays."
1996
SIG in (1/SIG) is the total hadronic cross section. The erros are statistical ones. The cross sections SIG(C=A), SIG(C=B), and SIG(C=C) obtained with A) both kaons identified, B) at least one kaon identified, and C) without requiring kaon identification.